Horizontal visibility graph of a random restricted growth sequence
نویسندگان
چکیده
We study the distributional properties of horizontal visibility graphs associated with random restrictive growth sequences and set partitions size n. Our main results are formulas expressing expected degree graph nodes in terms simple explicit functions a finite collection Stirling Bernoulli numbers.
منابع مشابه
Restricted random walks on a graph
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the number of n-step walks with r reversal steps for walks on any graph. In the case of graphs of a uniform valence, we show that our result has a probabilistic mean...
متن کاملCompactified Horizontal Visibility Graph for the Language Network
A compactified horizontal visibility graph for the language network is proposed. It was found that the networks constructed in such way are scale free, and have a property that among the nodes with largest degrees there are words that determine not only a text structure communication, but also its informational structure. Construction of networks with text elements, words, phrases or fragments ...
متن کاملHorizontal visibility graphs: exact results for random time series.
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows us to apply methods of complex network theory for characterizing time series. In this work we present the horizontal visibility algorithm, a geometrically simpler and analytically solvable version of our former algorithm, focusing on the mapping of random series (se...
متن کاملDERGMs: Degeneracy-restricted exponential random graph models
We propose a new exponential family of models for random graphs. Starting from the standard exponential random graph model (ERGM) framework, we propose an extension that addresses some of the well-known issues with ERGMs. Specifically, we solve the problem of computational intractability and ‘degenerate’ model behavior by an interpretable support restriction.
متن کاملOn the random graph induced by a random key predistribution scheme under full visibility (Extended version)
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier results and analogies with Erdős-Renyi graphs, we explore similar results for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2021
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2020.102145